On Multi-dimensional Hilbert Indexings
نویسندگان
چکیده
Indexing schemes for grids based on space-lling curves (e.g., Hilbert indexings) nd applications in numerous elds, ranging from parallel processing over data structures to image processing. Because of an increasing interest in discrete multi-dimensional spaces, indexing schemes for them have won considerable interest. Hilbert curves are the most simple and popular space-lling indexing scheme. We extend the concept of curves with Hilbert property to arbitrary dimensions and present rst results concerning their structural analysis that also simplify their applicability. We deene and analyze in a precise mathematical way r-dimensional Hilbert in-dexings for arbitrary r 2. Moreover, we generalize and simplify previous work and clarify the concept of Hilbert curves for multi-dimensional grids. As we show, Hilbert indexings can be completely described and analyzed by \generating elements of order 1", thus, in comparison with previous work, reducing their structural complexity decisively. This structural analysis like e.g. investigations concerning locality can always be reduced to small generating elements of the curves. In addition,whereas there is basically one Hilbert curve in the 2D world, our analysis shows that there are 1536 structurally diierent 3D Hilbert curves. Further results include generalizations of locality results for multi-dimensional indexings and an easy recursive computation scheme for multi-dimensional Hilbert indexings. In addition, our formalism lays the groundwork for potential mechanized analysis of locality properties of multi-dimensional Hilbert indexings.
منابع مشابه
Towards Optimal Locality in Mesh-Indexings
The eeciency of many algorithms in parallel processing, computational geometry, image processing, and several other elds relies on \locality-preserving" indexing schemes for meshes. We concentrate on the case where the maximum distance between two mesh nodes indexed i and j shall be a slow-growing function of ji ? jj (using the Euclidean, the maximum, and the Manhattan metric). In this respect,...
متن کاملTowards Optimal Locality in Mesh-Indexings1
The e ciency of many data structures and algorithms relies on \locality-preserving" indexing schemes for meshes. We concentrate on the case where the maximal distance between two mesh nodes indexed i and j shall be a slow-growing function of ji jj. We present a new 2-D indexing scheme we call H-indexing, which has superior (supposedly optimal) locality in comparison with the well-known Hilbert ...
متن کاملTowards Optimal Locality in Mesh
The eeciency of many algorithms in parallel processing, computational geometry, image processing, and several other elds relies on \locality-preserving" indexing schemes for meshes. We concentrate on the case where the maximum distance between two mesh nodes indexed i and j shall be a slow-growing function of ji ? jj (using the Euclidean, the maximum, and the Manhattan metric). In this respect,...
متن کاملAn extension theorem for finite positive measures on surfaces of finite dimensional unit balls in Hilbert spaces
A consistency criteria is given for a certain class of finite positive measures on the surfaces of the finite dimensional unit balls in a real separable Hilbert space. It is proved, through a Kolmogorov type existence theorem, that the class induces a unique positive measure on the surface of the unit ball in the Hilbert space. As an application, this will naturally accomplish the work of Kante...
متن کاملOn the study of Hilbert-type inequalities with multi-parameters: a Survey
In this paper, we provide a short account of the study of Hilbert-typeinequalities during the past almost 100 years by introducing multi-parametersand using the method of weight coefficients. A basic theorem of Hilbert-typeinequalities with the homogeneous kernel of −−degree and parameters is proved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998